Semi-supervised Learning Using Local Regularizer and Unit Circle Class Label Representation
نویسنده
چکیده
Semi-supervised learning, which aims to learn from partially labeled data and mostly unlabeled data, has been attracted more and more attention in machine learning and pattern recognition. A novel semi-supervised classification approach is proposed, which can not only handle semi-supervised binary classification problem but also deal with semi-supervised multi-class classification problem. The approach is based on local regularizer and unit circle class label representation. The former is minimized so as to cause the class labels to have the desired properties. The latter utilizes two-dimensional vector evenly distributed in circumference of unit circle to represent class label, so multi-class classification can be performed only once. Comparative classification experiments on some benchmark datasets validate the effectiveness of the presented approach.
منابع مشابه
Semi-supervised Data Representation via Affinity Graph Learning
We consider the general problem of utilizing both labeled and unlabeled data to improve data representation performance. A new semi-supervised learning framework is proposed by combing manifold regularization and data representation methods such as Non negative matrix factorization and sparse coding. We adopt unsupervised data representation methods as the learning machines because they do not ...
متن کاملRegularized Boost for Semi-Supervised Learning
Semi-supervised inductive learning concerns how to learn a decision rule from a data set containing both labeled and unlabeled data. Several boosting algorithms have been extended to semi-supervised learning with various strategies. To our knowledge, however, none of them takes local smoothness constraints among data into account during ensemble learning. In this paper, we introduce a local smo...
متن کاملCoConut: Co-Classification with Output Space Regularization
In this work we introduce a new approach to co-classification, i.e. the task of jointly classifying multiple, otherwise independent, data samples. The method we present, named CoConut, is based on the idea of adding a regularizer in the label space to encode certain priors on the resulting labelings. A regularizer that encourages labelings that are smooth across the test set, for instance, can ...
متن کاملComposite Kernel Optimization in Semi-Supervised Metric
Machine-learning solutions to classification, clustering and matching problems critically depend on the adopted metric, which in the past was selected heuristically. In the last decade, it has been demonstrated that an appropriate metric can be learnt from data, resulting in superior performance as compared with traditional metrics. This has recently stimulated a considerable interest in the to...
متن کاملOn the Effectiveness of Laplacian Normalization for Graph Semi-supervised Learning
This paper investigates the effect of Laplacian normalization in graph-based semi-supervised learning. To this end, we consider multi-class transductive learning on graphs with Laplacian regularization. Generalization bounds are derived using geometric properties of the graph. Specifically, by introducing a definition of graph cut from learning theory, we obtain generalization bounds that depen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- JSW
دوره 7 شماره
صفحات -
تاریخ انتشار 2012